منابع مشابه
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k ≥ 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being Ck-minor free (resp., free from having the corresponding tree-minor). In particular, if the graph is Ω(1)-far from being cycle-free (i.e., a constant fraction of the ed...
متن کاملFinding Frequent Patterns in a String in Sublinear Time
We consider the problem of testing whether (a large part of) a given string X of length n over some finite alphabet is covered by multiple occurrences of some (unspecified) pattern Y of arbitrary length in the combinatorial property testing model. Our algorithms randomly query a sublinear number of positions of X, and run in sublinear time in n. We first focus on finding patterns of a given len...
متن کاملProduct Trees for Gaussian Process Covariance in Sublinear Time
Gaussian process (GP) regression is a powerful technique for nonparametric regression; unfortunately, calculating the predictive variance in a standard GP model requires time O(n) in the size of the training set. This is cost prohibitive when GP likelihood calculations must be done in the inner loop of the inference procedure for a larger model (e.g., MCMC). Previous work by Shen et al. (2006) ...
متن کاملColoring in Sublinear Time
We will present an algorithm, based on SA-techniques and a sampling procedure, that colors a given random 3-colorable graph with high probability in sublinear time. This result is the rst theoretical justiication of many excellent experimental performance results of Simulated Annealing 10, 17] applied to graph coloring problems.
متن کاملFinding Short Cycles in an Embedded Graph in Polynomial Time
Let C1 be the set of fundamental cycles of breadth-first-search trees in a graph G and C2 the set of the sums of two cycles in C1. Then we show that (1).C = C1 ⋃ C2 contains a shortest Π-twosided cycle in a Π-embedded graph G.This implies the existence of a polynomially bounded algorithm to find a shortest Π−twosided cycle in an embedded graph and thus solves an open problem of Mohar and Thomas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2012
ISSN: 1042-9832
DOI: 10.1002/rsa.20462